No 17-player Triplewhist Tournament Has Nontrivial Automorphisms
نویسنده
چکیده
The existence of triplewhist tournaments for v players has recently been solved for all values of v except v = 17. For v = 12 and v = 13 a complete enumeration has shown the nonexistence of TWh (v), while constructions of TWh (v) have been presented for v > 17. For several values of v existence has been shown by constructing a TWh (v) with a prescribed, usually cyclic, automorphism group. In this article it is shown that the strategy of constructing a TWh (v) with a prescribed automorphism group cannot succeed with TWh (17), since no 17-player triplewhist tournament has nontrivial automorphisms.
منابع مشابه
Classification of whist tournaments with up to 12 players
A v-player whist tournament Wh(v) is a schedule of games, each involving two players opposing two others. Every round, the players are partitioned into games, with at most one player left over. Each player partners every other player exactly once and opposes every other player exactly twice during the tournament. Directed whist tournaments DWh(v), and triplewhist tournaments TWh(v), are Wh(v) w...
متن کاملSplittable Triplewhist Tournament Designs
We show that Z-cyclic splittable triplewhist tournament designs exist for all primes of the form p = 8t + 1, t odd, except possibly p = 41.
متن کاملThe Near Resolvable 2-(13, 4, 3) Designs and Thirteen-Player Whist Tournaments
A v-player whist tournament is a schedule of games, where in each round the v players are partitioned into games of four players each with at most one player left over. In each game two of the players play as partners against the other two. All pairs of players must play in the same game exactly three times during the tournament; of those three times, they are to play as partners exactly once. ...
متن کاملAn existence theorem for cyclic triplewhist tournaments
We show that a Z-cyclic triplewhist tournament TWh(v) exists whenever v =p] . . . . p~ where the primes p~ are -5(mod8) , p~>29. The method of construction uses the existence of a primitive root ~o of each such Pi (~61) such that ~o2+eo+ 1 are both squares (modpi).
متن کاملEfficient Simulation of a Random Knockout Tournament
We consider the problem of using simulation to efficiently estimate the win probabilities for participants in a general random knockout tournament. Both of our proposed estimators, one based on the notion of “observed survivals” and the other based on conditional expectation and post-stratification, are highly effective in terms of variance reduction when compared to the raw simulation estimato...
متن کامل